#ifndef _SEARCH_H_
#define _SEARCH_H_

#include <iostream>
#include <vector>
#include <math.h>

using namespace std;

vector<vector<int> > Dijkstra(double ** Graph, int graph_size, int source);
vector<int> Dijkstra(double ** Graph, int graph_size, int source, int target);
vector<vector<vector<int> > > DijkstraK(double ** Graph, int graph_size, int source, int K);
int best_i();

#endif
